Base | Representation |
---|---|
bin | 10001111001101110001… |
… | …111100010101000000000 |
3 | 11100121101110120000022002 |
4 | 101321232033202220000 |
5 | 130123432303330100 |
6 | 2341052322203132 |
7 | 154610520200606 |
oct | 21715617425000 |
9 | 4317343500262 |
10 | 1230210214400 |
11 | 43480265a332 |
12 | 17a50aab34a8 |
13 | 8c0153a240b |
14 | 43784853876 |
15 | 22001eda2d5 |
hex | 11e6e3e2a00 |
1230210214400 has 60 divisors (see below), whose sum is σ = 3047941948062. Its totient is φ = 492084080640.
The previous prime is 1230210214379. The next prime is 1230210214439. The reversal of 1230210214400 is 44120120321.
It can be written as a sum of positive squares in 3 ways, for example, as 469016783104 + 761193431296 = 684848^2 + 872464^2 .
It is a super-2 number, since 2×12302102144002 (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 5 ways as a sum of consecutive naturals, for example, 48042287 + ... + 48067886.
Almost surely, 21230210214400 is an apocalyptic number.
1230210214400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1230210214400 is an abundant number, since it is smaller than the sum of its proper divisors (1817731733662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1230210214400 is an frugal number, since it uses more digits than its factorization.
1230210214400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96110201 (or 96110180 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 1230210214400 its reverse (44120120321), we get a palindrome (1274330334721).
The spelling of 1230210214400 in words is "one trillion, two hundred thirty billion, two hundred ten million, two hundred fourteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •