Base | Representation |
---|---|
bin | 1100011011101… |
… | …1000011100010 |
3 | 10122010022102020 |
4 | 3012323003202 |
5 | 101322141102 |
6 | 5101402310 |
7 | 1202144220 |
oct | 306730342 |
9 | 118108366 |
10 | 52146402 |
11 | 27487400 |
12 | 15569396 |
13 | aa5a379 |
14 | 6cd5b10 |
15 | 48a0bbc |
hex | 31bb0e2 |
52146402 has 96 divisors (see below), whose sum is σ = 135647232. Its totient is φ = 13068000.
The previous prime is 52146397. The next prime is 52146403. The reversal of 52146402 is 20464125.
52146402 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (52146403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 157377 + ... + 157707.
It is an arithmetic number, because the mean of its divisors is an integer number (1412992).
Almost surely, 252146402 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52146402, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67823616).
52146402 is an abundant number, since it is smaller than the sum of its proper divisors (83500830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52146402 is a wasteful number, since it uses less digits than its factorization.
52146402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396 (or 385 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 52146402 is about 7221.2465682872. The cubic root of 52146402 is about 373.6010740615.
The spelling of 52146402 in words is "fifty-two million, one hundred forty-six thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •