Base | Representation |
---|---|
bin | 11011100001000111011101… |
… | …100001011001111111001011 |
3 | 120212111200112122121122200110 |
4 | 123201013131201121333023 |
5 | 111330320111031140243 |
6 | 1105221111524005403 |
7 | 34330424002661364 |
oct | 3341073541317713 |
9 | 525450478548613 |
10 | 121023010021323 |
11 | 3561a630103753 |
12 | 116a70a1230863 |
13 | 526b561882b37 |
14 | 21c578b452b6b |
15 | ded14600ae33 |
hex | 6e11dd859fcb |
121023010021323 has 4 divisors (see below), whose sum is σ = 161364013361768. Its totient is φ = 80682006680880.
The previous prime is 121023010021267. The next prime is 121023010021369. The reversal of 121023010021323 is 323120010320121.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 121023010021323 - 29 = 121023010020811 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121023010021323.
It is not an unprimeable number, because it can be changed into a prime (121023010021373) 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, 20170501670218 + ... + 20170501670223.
It is an arithmetic number, because the mean of its divisors is an integer number (40341003340442).
Almost surely, 2121023010021323 is an apocalyptic number.
121023010021323 is a deficient number, since it is larger than the sum of its proper divisors (40341003340445).
121023010021323 is an equidigital number, since it uses as much as digits as its factorization.
121023010021323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40341003340444.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121023010021323 its reverse (323120010320121), we get a palindrome (444143020341444).
The spelling of 121023010021323 in words is "one hundred twenty-one trillion, twenty-three billion, ten million, twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •