Base | Representation |
---|---|
bin | 101100011101001100111… |
… | …110111000100000001001 |
3 | 101211001112010111111010101 |
4 | 230131030332320200021 |
5 | 400023131401101413 |
6 | 10255242001245401 |
7 | 433501035410356 |
oct | 54351476704011 |
9 | 11731463444111 |
10 | 3055013300233 |
11 | a78695400464 |
12 | 4140b9933861 |
13 | 19211810726b |
14 | a7c1338b62d |
15 | 547042baedd |
hex | 2c74cfb8809 |
3055013300233 has 4 divisors (see below), whose sum is σ = 3062631787668. Its totient is φ = 3047394812800.
The previous prime is 3055013300231. The next prime is 3055013300263. The reversal of 3055013300233 is 3320033105503.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2568188938249 + 486824361984 = 1602557^2 + 697728^2 .
It is a cyclic number.
It is not a de Polignac number, because 3055013300233 - 21 = 3055013300231 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3055013300231) 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, 3809243116 + ... + 3809243917.
It is an arithmetic number, because the mean of its divisors is an integer number (765657946917).
Almost surely, 23055013300233 is an apocalyptic number.
It is an amenable number.
3055013300233 is a deficient number, since it is larger than the sum of its proper divisors (7618487435).
3055013300233 is an equidigital number, since it uses as much as digits as its factorization.
3055013300233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7618487434.
The product of its (nonzero) digits is 12150, while the sum is 28.
Adding to 3055013300233 its reverse (3320033105503), we get a palindrome (6375046405736).
The spelling of 3055013300233 in words is "three trillion, fifty-five billion, thirteen million, three hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •