Base | Representation |
---|---|
bin | 101011001001001111… |
… | …101101100011000100 |
3 | 11102120112120020200221 |
4 | 223021033231203010 |
5 | 1224333424341400 |
6 | 33140515114124 |
7 | 3230000414524 |
oct | 531117554304 |
9 | 142515506627 |
10 | 46326012100 |
11 | 1871290a615 |
12 | 8b8a5a2944 |
13 | 44a3855ba4 |
14 | 2356801684 |
15 | 131206ac1a |
hex | ac93ed8c4 |
46326012100 has 36 divisors (see below), whose sum is σ = 102424202244. Its totient is φ = 18180772480.
The previous prime is 46326012091. The next prime is 46326012101. The reversal of 46326012100 is 121062364.
46326012100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 4702667776 + 41623344324 = 68576^2 + 204018^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (46326012101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4365079 + ... + 4375678.
It is an arithmetic number, because the mean of its divisors is an integer number (2845116729).
Almost surely, 246326012100 is an apocalyptic number.
It is an amenable number.
46326012100 is an abundant number, since it is smaller than the sum of its proper divisors (56098190144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46326012100 is a wasteful number, since it uses less digits than its factorization.
46326012100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8740824 (or 8740817 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 46326012100 its reverse (121062364), we get a palindrome (46447074464).
The spelling of 46326012100 in words is "forty-six billion, three hundred twenty-six million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •