Base | Representation |
---|---|
bin | 101111000000001011100… |
… | …111001101000111100001 |
3 | 102102210012222002202210020 |
4 | 233000023213031013201 |
5 | 410410030104431223 |
6 | 10511502441024053 |
7 | 452234443660503 |
oct | 57001347150741 |
9 | 12383188082706 |
10 | 3230010233313 |
11 | 1035926630396 |
12 | 441bb7a85029 |
13 | 1a5786387c86 |
14 | b2494927d73 |
15 | 590476641e3 |
hex | 2f00b9cd1e1 |
3230010233313 has 4 divisors (see below), whose sum is σ = 4306680311088. Its totient is φ = 2153340155540.
The previous prime is 3230010233309. The next prime is 3230010233383. The reversal of 3230010233313 is 3133320100323.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3230010233313 - 22 = 3230010233309 is a prime.
It is a super-2 number, since 2×32300102333132 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3230010233383) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 538335038883 + ... + 538335038888.
It is an arithmetic number, because the mean of its divisors is an integer number (1076670077772).
Almost surely, 23230010233313 is an apocalyptic number.
It is an amenable number.
3230010233313 is a deficient number, since it is larger than the sum of its proper divisors (1076670077775).
3230010233313 is a wasteful number, since it uses less digits than its factorization.
3230010233313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1076670077774.
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 3230010233313 its reverse (3133320100323), we get a palindrome (6363330333636).
The spelling of 3230010233313 in words is "three trillion, two hundred thirty billion, ten million, two hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •