Base | Representation |
---|---|
bin | 10101001000001100101… |
… | …100110001111010000000 |
3 | 12010210122020121012122110 |
4 | 111020030230301322000 |
5 | 142242003433331032 |
6 | 3030555453135320 |
7 | 206616506320023 |
oct | 25101454617200 |
9 | 5123566535573 |
10 | 1451912011392 |
11 | 50a83052a847 |
12 | 1b548248a540 |
13 | a6bb782468b |
14 | 503b6c4d1ba |
15 | 27b7a7d67cc |
hex | 1520cb31e80 |
1451912011392 has 32 divisors (see below), whose sum is σ = 3856641281280. Its totient is φ = 483970670336.
The previous prime is 1451912011387. The next prime is 1451912011399. The reversal of 1451912011392 is 2931102191541.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 1451912011392.
It is not an unprimeable number, because it can be changed into a prime (1451912011399) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1890510048 + ... + 1890510815.
It is an arithmetic number, because the mean of its divisors is an integer number (120520040040).
Almost surely, 21451912011392 is an apocalyptic number.
1451912011392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1451912011392 is an abundant number, since it is smaller than the sum of its proper divisors (2404729269888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451912011392 is an equidigital number, since it uses as much as digits as its factorization.
1451912011392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3781020880 (or 3781020868 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 39.
The spelling of 1451912011392 in words is "one trillion, four hundred fifty-one billion, nine hundred twelve million, eleven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •