Base | Representation |
---|---|
bin | 10100111010110001101011… |
… | …11001011111101100100000 |
3 | 20000212120001101000000112201 |
4 | 22131120311321133230200 |
5 | 22012131002011122030 |
6 | 241500035441102544 |
7 | 12455250660434230 |
oct | 1235306571375440 |
9 | 200776041000481 |
10 | 46000004004640 |
11 | 13725546052244 |
12 | 51ab138327a54 |
13 | 1c88a216ca26a |
14 | b505aaa2bcc0 |
15 | 54b8741e62ca |
hex | 29d635e5fb20 |
46000004004640 has 48 divisors (see below), whose sum is σ = 124200010815552. Its totient is φ = 15771429944064.
The previous prime is 46000004004523. The next prime is 46000004004659. The reversal of 46000004004640 is 4640040000064.
It is a super-3 number, since 3×460000040046403 (a number of 42 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 46000004004599 and 46000004004608.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20535714954 + ... + 20535717193.
It is an arithmetic number, because the mean of its divisors is an integer number (2587500225324).
Almost surely, 246000004004640 is an apocalyptic number.
46000004004640 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
46000004004640 is an abundant number, since it is smaller than the sum of its proper divisors (78200006810912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46000004004640 is a wasteful number, since it uses less digits than its factorization.
46000004004640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41071432169 (or 41071432161 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
The spelling of 46000004004640 in words is "forty-six trillion, four million, four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •