Base | Representation |
---|---|
bin | 1101100100000010001… |
… | …0011011111010000101 |
3 | 211021102221022101111122 |
4 | 3121000202123322011 |
5 | 12304201304044023 |
6 | 255013242243325 |
7 | 22556141563205 |
oct | 3310042337205 |
9 | 737387271448 |
10 | 233011003013 |
11 | 8a901700378 |
12 | 391aaab6545 |
13 | 18c8544ba59 |
14 | b3c6398405 |
15 | 60db5b72c8 |
hex | 364089be85 |
233011003013 has 16 divisors (see below), whose sum is σ = 249179976000. Its totient is φ = 217126348032.
The previous prime is 233011003009. The next prime is 233011003021. The reversal of 233011003013 is 310300110332.
It is a cyclic number.
It is not a de Polignac number, because 233011003013 - 22 = 233011003009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 233011002982 and 233011003000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233011003073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 529658 + ... + 864036.
It is an arithmetic number, because the mean of its divisors is an integer number (15573748500).
Almost surely, 2233011003013 is an apocalyptic number.
It is an amenable number.
233011003013 is a deficient number, since it is larger than the sum of its proper divisors (16168972987).
233011003013 is a wasteful number, since it uses less digits than its factorization.
233011003013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334804.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 233011003013 its reverse (310300110332), we get a palindrome (543311113345).
The spelling of 233011003013 in words is "two hundred thirty-three billion, eleven million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •