Base | Representation |
---|---|
bin | 11110010001101111001… |
… | …10110111101111101000 |
3 | 10200110020100020202100120 |
4 | 33020313212313233220 |
5 | 114021031121203222 |
6 | 2113525241203240 |
7 | 135105655534146 |
oct | 17106746675750 |
9 | 3613210222316 |
10 | 1040315022312 |
11 | 371216788955 |
12 | 149753490520 |
13 | 771416a8727 |
14 | 384cc7b8596 |
15 | 1c0dac2815c |
hex | f2379b7be8 |
1040315022312 has 16 divisors (see below), whose sum is σ = 2600787555840. Its totient is φ = 346771674096.
The previous prime is 1040315022311. The next prime is 1040315022323. The reversal of 1040315022312 is 2132205130401.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 43346459263 = 1040315022312 / (1 + 0 + 4 + 0 + 3 + 1 + 5 + 0 + 2 + 2 + 3 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (1040315022311) 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, 21673229608 + ... + 21673229655.
It is an arithmetic number, because the mean of its divisors is an integer number (162549222240).
Almost surely, 21040315022312 is an apocalyptic number.
1040315022312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1040315022312 is an abundant number, since it is smaller than the sum of its proper divisors (1560472533528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040315022312 is a wasteful number, since it uses less digits than its factorization.
1040315022312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43346459272 (or 43346459268 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The spelling of 1040315022312 in words is "one trillion, forty billion, three hundred fifteen million, twenty-two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •