Base | Representation |
---|---|
bin | 1001011000101110000111… |
… | …1000000011100010000011 |
3 | 1100112121111112002121012102 |
4 | 2112023201320003202003 |
5 | 2323041434024404443 |
6 | 33541025243221015 |
7 | 2113421452133063 |
oct | 226134170034203 |
9 | 40477445077172 |
10 | 10320301013123 |
11 | 33198a6965a12 |
12 | 11a8187b1776b |
13 | 59b27ab25a1a |
14 | 2797105113a3 |
15 | 12d6c49cbcb8 |
hex | 962e1e03883 |
10320301013123 has 16 divisors (see below), whose sum is σ = 10832152541760. Its totient is φ = 9813720812544.
The previous prime is 10320301013069. The next prime is 10320301013131. The reversal of 10320301013123 is 32131010302301.
It is a cyclic number.
It is not a de Polignac number, because 10320301013123 - 212 = 10320301009027 is a prime.
It is a super-2 number, since 2×103203010131232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10320301013095 and 10320301013104.
It is not an unprimeable number, because it can be changed into a prime (10320301013423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51184715 + ... + 51385947.
It is an arithmetic number, because the mean of its divisors is an integer number (677009533860).
Almost surely, 210320301013123 is an apocalyptic number.
10320301013123 is a deficient number, since it is larger than the sum of its proper divisors (511851528637).
10320301013123 is a wasteful number, since it uses less digits than its factorization.
10320301013123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214318.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10320301013123 its reverse (32131010302301), we get a palindrome (42451311315424).
The spelling of 10320301013123 in words is "ten trillion, three hundred twenty billion, three hundred one million, thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •