Base | Representation |
---|---|
bin | 10001111011100000110… |
… | …000010101000000100000 |
3 | 11100210100100121221221202 |
4 | 101323200300111000200 |
5 | 130141401120141000 |
6 | 2342011112140332 |
7 | 155006236125026 |
oct | 21734060250040 |
9 | 4323310557852 |
10 | 1232131412000 |
11 | 4355a9073545 |
12 | 17a9663976a8 |
13 | 8c260418528 |
14 | 438c7a78716 |
15 | 220b59d3dd5 |
hex | 11ee0c15020 |
1232131412000 has 48 divisors (see below), whose sum is σ = 3027346889112. Its totient is φ = 492852563200.
The previous prime is 1232131411997. The next prime is 1232131412077. The reversal of 1232131412000 is 2141312321.
It can be written as a sum of positive squares in 4 ways, for example, as 263017173904 + 969114238096 = 512852^2 + 984436^2 .
It is a super-2 number, since 2×12321314120002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154012427 + ... + 154020426.
Almost surely, 21232131412000 is an apocalyptic number.
1232131412000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1232131412000 is an abundant number, since it is smaller than the sum of its proper divisors (1795215477112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1232131412000 is an equidigital number, since it uses as much as digits as its factorization.
1232131412000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 308032878 (or 308032860 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1232131412000 its reverse (2141312321), we get a palindrome (1234272724321).
The spelling of 1232131412000 in words is "one trillion, two hundred thirty-two billion, one hundred thirty-one million, four hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •