Base | Representation |
---|---|
bin | 11101100111000110001111… |
… | …000010101000001111010100 |
3 | 122002002212122210210122021111 |
4 | 131213012033002220033110 |
5 | 114032142222410304022 |
6 | 1140550514500224404 |
7 | 36300546234561055 |
oct | 3547061702501724 |
9 | 562085583718244 |
10 | 130230103213012 |
11 | 3854a305198970 |
12 | 1273357209b104 |
13 | 578885246652a |
14 | 24232562b472c |
15 | 100c8b5733477 |
hex | 76718f0a83d4 |
130230103213012 has 12 divisors (see below), whose sum is σ = 248621106134016. Its totient is φ = 59195501460440.
The previous prime is 130230103213003. The next prime is 130230103213031. The reversal of 130230103213012 is 210312301032031.
It is a super-2 number, since 2×1302301032130122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1479887536468 + ... + 1479887536555.
It is an arithmetic number, because the mean of its divisors is an integer number (20718425511168).
Almost surely, 2130230103213012 is an apocalyptic number.
It is an amenable number.
130230103213012 is a deficient number, since it is larger than the sum of its proper divisors (118391002921004).
130230103213012 is a wasteful number, since it uses less digits than its factorization.
130230103213012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2959775073038 (or 2959775073036 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 130230103213012 its reverse (210312301032031), we get a palindrome (340542404245043).
The spelling of 130230103213012 in words is "one hundred thirty trillion, two hundred thirty billion, one hundred three million, two hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •