Base | Representation |
---|---|
bin | 1010010001110100010111… |
… | …1011100111100100000110 |
3 | 1111000101110022012120110112 |
4 | 2210131011323213210012 |
5 | 2440124410421242410 |
6 | 40011414151153022 |
7 | 2244326032555322 |
oct | 244350573474406 |
9 | 44011408176415 |
10 | 11301232212230 |
11 | 3667909a63524 |
12 | 1326307975772 |
13 | 63c91761500c |
14 | 2b0da81d0982 |
15 | 148e87118105 |
hex | a4745ee7906 |
11301232212230 has 16 divisors (see below), whose sum is σ = 20528843837040. Its totient is φ = 4479020472672.
The previous prime is 11301232212227. The next prime is 11301232212241. The reversal of 11301232212230 is 3221223210311.
11301232212230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11301232212196 and 11301232212205.
It is a congruent number.
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, 5184050384 + ... + 5184052563.
It is an arithmetic number, because the mean of its divisors is an integer number (1283052739815).
Almost surely, 211301232212230 is an apocalyptic number.
11301232212230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11301232212230 is a deficient number, since it is larger than the sum of its proper divisors (9227611624810).
11301232212230 is a wasteful number, since it uses less digits than its factorization.
11301232212230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10368103063.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11301232212230 its reverse (3221223210311), we get a palindrome (14522455422541).
The spelling of 11301232212230 in words is "eleven trillion, three hundred one billion, two hundred thirty-two million, two hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •