Base | Representation |
---|---|
bin | 10010100100110011001… |
… | …000110010110001000000 |
3 | 11112000202220202122122112 |
4 | 102210303020302301000 |
5 | 131403144041330031 |
6 | 2414222112554452 |
7 | 161135643301622 |
oct | 22446310626100 |
9 | 4460686678575 |
10 | 1276463230016 |
11 | 452388241577 |
12 | 187478b52a28 |
13 | 934a6a7a900 |
14 | 45ad1692c12 |
15 | 2330c93762b |
hex | 12933232c40 |
1276463230016 has 168 divisors, whose sum is σ = 2948624714880. Its totient is φ = 546250438656.
The previous prime is 1276463229991. The next prime is 1276463230019. The reversal of 1276463230016 is 6100323646721.
It is not an unprimeable number, because it can be changed into a prime (1276463230019) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9592610 + ... + 9724766.
Almost surely, 21276463230016 is an apocalyptic number.
1276463230016 is a gapful number since it is divisible by the number (16) 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 1276463230016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1474312357440).
1276463230016 is an abundant number, since it is smaller than the sum of its proper divisors (1672161484864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1276463230016 is a wasteful number, since it uses less digits than its factorization.
1276463230016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132261 (or 132238 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 41.
Adding to 1276463230016 its reverse (6100323646721), we get a palindrome (7376786876737).
The spelling of 1276463230016 in words is "one trillion, two hundred seventy-six billion, four hundred sixty-three million, two hundred thirty thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •