Base | Representation |
---|---|
bin | 1011001100000001101001… |
… | …1100100011110010111011 |
3 | 1121112222121212112010111122 |
4 | 2303000122130203302323 |
5 | 3103020404341430021 |
6 | 42055035043015455 |
7 | 2406506643015236 |
oct | 263003234436273 |
9 | 47488555463448 |
10 | 12301230030011 |
11 | 3a12a1672892a |
12 | 146808906a58b |
13 | 6b30022c84b0 |
14 | 30755022a41d |
15 | 164eb359cbab |
hex | b301a723cbb |
12301230030011 has 8 divisors (see below), whose sum is σ = 13555559389680. Its totient is φ = 11090912226912.
The previous prime is 12301230029989. The next prime is 12301230030043. The reversal of 12301230030011 is 11003003210321.
12301230030011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12301230030011 - 26 = 12301230029947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12301230030811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11002888556 + ... + 11002889673.
It is an arithmetic number, because the mean of its divisors is an integer number (1694444923710).
Almost surely, 212301230030011 is an apocalyptic number.
12301230030011 is a deficient number, since it is larger than the sum of its proper divisors (1254329359669).
12301230030011 is a wasteful number, since it uses less digits than its factorization.
12301230030011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22005778285.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 12301230030011 its reverse (11003003210321), we get a palindrome (23304233240332).
The spelling of 12301230030011 in words is "twelve trillion, three hundred one billion, two hundred thirty million, thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •