Base | Representation |
---|---|
bin | 10010001101000010110101… |
… | …01110110000000000000000 |
3 | 12020201220000112222020220220 |
4 | 21012201122232300000000 |
5 | 20221330201023402032 |
6 | 221045451201303040 |
7 | 11301055005504330 |
oct | 1106413256600000 |
9 | 166656015866826 |
10 | 40030617403392 |
11 | 11833986a23440 |
12 | 45a6250934a80 |
13 | 1944b4283c9c5 |
14 | 9c56c691b0c0 |
15 | 49644cb5012c |
hex | 24685abb0000 |
40030617403392 has 544 divisors, whose sum is σ = 134066179966464. Its totient is φ = 10321133568000.
The previous prime is 40030617403339. The next prime is 40030617403409. The reversal of 40030617403392 is 29330471603004.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2074008142 + ... + 2074027442.
Almost surely, 240030617403392 is an apocalyptic number.
40030617403392 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40030617403392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67033089983232).
40030617403392 is an abundant number, since it is smaller than the sum of its proper divisors (94035562563072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40030617403392 is a wasteful number, since it uses less digits than its factorization.
40030617403392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19491 (or 19461 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 42.
The spelling of 40030617403392 in words is "forty trillion, thirty billion, six hundred seventeen million, four hundred three thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •