Base | Representation |
---|---|
bin | 10010001111101110111011… |
… | …11000001111011100100000 |
3 | 12021001201111200202002111020 |
4 | 21013313131320033130200 |
5 | 20224333412034120000 |
6 | 221200131322445440 |
7 | 11310535433003400 |
oct | 1107673570173440 |
9 | 167051450662436 |
10 | 40123012020000 |
11 | 1186a08a30a418 |
12 | 4600137663880 |
13 | 19507787b4490 |
14 | 9c9d6d876800 |
15 | 498a5933cba0 |
hex | 247ddde0f720 |
40123012020000 has 720 divisors, whose sum is σ = 164876107156992. Its totient is φ = 8465506560000.
The previous prime is 40123012019977. The next prime is 40123012020011. The reversal of 40123012020000 is 2021032104.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 37695105 + ... + 38744895.
Almost surely, 240123012020000 is an apocalyptic number.
40123012020000 is a gapful number since it is divisible by the number (40) 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 40123012020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82438053578496).
40123012020000 is an abundant number, since it is smaller than the sum of its proper divisors (124753095136992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40123012020000 is a wasteful number, since it uses less digits than its factorization.
40123012020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049851 (or 1049821 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 40123012020000 its reverse (2021032104), we get a palindrome (40125033052104).
The spelling of 40123012020000 in words is "forty trillion, one hundred twenty-three billion, twelve million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •